Integer codes correcting sparse byte errors

Perfect Byte-Correcting Codes

We present a few new constructions for perfect linear single byte-correcting codes. These constructions generate some perfect single byte-correcting codes with new parameters, and some perfect single bytecorrecting codes with known parameters and simpler presentation and implementation over the known codes. It is also shown that nonequivalent perfect linear single byte-correcting codes exist wh...

New Double-Byte Error-Correcting Codes for Memory Systems

Error-correcting or error-detecting codes have been used in the computer industry to increase reliability, reduce service costs, and maintain data integrity. The single-byte error-correcting and double-byte error-detecting (SbEC-DbED) codes have been successfully used in computer memory subsystems. There are many methods to construct double-byte error-correcting (DbEC) codes. In the present pap...

Cross-Error Correcting Integer Codes over ℤ2m

Codes Correcting Repeated Burst Errors Blockwise

This paper obtains bounds for linear codes which are capable to correct the errors blockwise which occur during the process of transmission. The kind of errors considered are known as repeated burst errors of length b(fixed), introduced by Dass and Garg (2009). An illustration for such kind of codes has also been provided. Mathematics Subject Classification: 94B20, 94B25, 94B65

Optimal codes for correcting single errors and detecting adjacent errors

Optimal codes that correct single errors and detect double errors within nibbles of power of two length are presented. For each n, a code of length n, with the largest possible dimension which corrects single errors and detects double adjacent errors is presented. The problem of constructing optimal codes, which correct single errors and detect double adjacent errors within nibbles of length 1 ...